t = int(input())
for i in range(t):
n = int(input())
if n % 7 == 0:
print(n)
else:
ans = -1
for j in range(10):
if (n - n % 10 + j) % 7 == 0:
ans = n - n % 10 + j
print(ans)
/*******************************************************
* IN THE NAME OF ALLAH , BISMILLAHIR RAHMANIR RAHIM *
********************************************************/
/*.............MD. JAHIDUL ISLAM (MYMENSING)............*/
#include<bits/stdc++.h>
using namespace std;
#define jahid long long
#define jahid_CSE_computer_Engineer() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
jahid_CSE_computer_Engineer();
jahid t;
cin>>t;
while(t--)
{
jahid a;
cin>>a;
if(a%7==0)
{
cout<<a<<endl;
}
else
{
a=a/10;
a=a*10;
while(a%7!=0)
{
a++;
}
cout<<a<<endl;
}
}
return 0;
}
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |